Bicolored digraph grammar systems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bicolored digraph grammar systems

— A new class of generating Systems (the bdg Systems), is introduced and they are shown to be equivalent to the class of programmed grammars. They have independent interest since their définition gives doser ties between language theory and graph theory. This in turn gives rise to a number of interesting hybrid graph — grammar open problems.

متن کامل

Bicolored digraph grammar systems

— A new class of generating Systems (the bdg Systems), is introduced and they are shown to be equivalent to the class of programmed grammars. They have independent interest since their définition gives doser ties between language theory and graph theory. This in turn gives rise to a number of interesting hybrid graph — grammar open problems.

متن کامل

Bidirectional Cooperating Distributed Grammar Systems Bidirectional Cooperating Distributed Grammar Systems

We consider bidirectional cooperating distributed (BCD) grammar systems in the sense of Asveld. Independently of their mode , , =, , or t, BCD grammar systems with two components characterize the re-cursively enumerable languages even with right-linear rules and without-productions. This sharply contrasts earlier results on solely generating or accepting grammars, where right-linear rules alway...

متن کامل

Digraph Decompositions and Monotonicity in Digraph Searching

We consider monotonicity problems for graph searching games. Variants of these games – defined by the type of moves allowed for the players – have been found to be closely connected to graph decompositions and associated width measures such as pathor tree-width. Of particular interest is the question whether these games are monotone, i.e. whether the cops can catch a robber without ever allowin...

متن کامل

General Multigenerative Grammar Systems

The formal language theory has intensively investigated various grammar systems (see [1], l2l, [8]), which consist of several cooperating components, usually represented by grammars. Although this variety is extremely broad, all these grammar systems always use a derivation that generates a single string. In this paper, however, we introduce grammar systems that simultaneously generate several ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Revue française d'automatique informatique recherche opérationnelle. Mathématique

سال: 1973

ISSN: 0397-9334

DOI: 10.1051/m2an/197307r100451